Recursion relative to regressive functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regressive functions on pairs

We compute an explicit upper bound for the regressive Ramsey numbers by a combinatorial argument, the corresponding function being of Ackermannian growth. For this, we look at the more general problem of bounding g(n,m), the least l such that any regressive function f : [m, l] → N admits a min-homogeneous set of size n. Analysis of this function also leads to the simplest known proof that the r...

متن کامل

A Relative Laplacian Spectral Recursion

The Laplacian spectral recursion, satisfied by matroid complexes and shifted complexes, expresses the eigenvalues of the combinatorial Laplacian of a simplicial complex in terms of its deletion and contraction with respect to vertex e, and the relative simplicial pair of the deletion modulo the contraction. We generalize this recursion to relative simplicial pairs, which we interpret as convex ...

متن کامل

A General Form of Relative Recursion

The purpose of this note is to observe a generalization of the concept “computable in. . . ” to arbitrary partial combinatory algebras. For every partial combinatory algebra (pca) A and every partial endofunction on A, a pca A[f ] is constructed such that in A[f ], the function f is representable by an element; a universal property of the construction is formulated in terms of Longley’s 2-categ...

متن کامل

Recursion Formulae for Hypergeometric Functions

indicates the term corresponding to j = h is to be deleted. If one of the a, = 0 or a negative integer, then (1) always converges, since it terminates. Otherwise it converges for all finite x if P ^ Q and for |a;| < 1 if P = Q + 1. In this case, however, the function can be analytically continued into the cut plane |arg (1 — a;)| < x, and we shall often denote by q+iFq(x) not only the series (1...

متن کامل

Some inequalities in connection to relative orders of entire functions of several complex variables

Let f, g and h be all entire functions of several complex variables. In this paper we would like to establish some inequalities on the basis of relative order and relative lower order of f with respect to g when the relative orders and relative lower orders of both f and g with respect to h are given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Mathematical Logic

سال: 1974

ISSN: 0003-4843

DOI: 10.1016/0003-4843(74)90002-3